Evaluating Secure Programming Knowledge

نویسندگان

  • Matt Bishop
  • Jun Dai
  • Melissa Dark
  • Ida Ngambeki
  • Phillip Nico
  • Minghua Zhu
چکیده

Secure programming is a widely used term for programming robustly. Applying the principles and methodologies of this style of programming would significantly improve the quality of software in use today. Teaching students how to program robustly, or securely, is a first step towards this goal. This paper presents a concept map for secure programming and then some questions used to evaluate students’ knowledge of this subject. These questions have been given both before and after a term of programming, computer security, and other classes that cover this subject. In this paper, we discuss how the questions reveal the students’ understanding of material in the concept map, and what erroneous ideas the questions reveal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and implementation of a virtual lab for supporting students in modeling, evaluating and programming secure systems

In this paper we refer on the design and implementation of a learning environment for supporting Computer Engineering students in the evaluation of algorithms and protocols for Information Security. Such an environment helps students to reinforce conceptual knowledge and to gain practical programming skills through several tools for continuous and automatic support. The virtual lab includes sev...

متن کامل

Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming

The fundamental primitives of Concurrent Constraint Programming (CCP), tell and ask, respectively adds knowledge to and infers knowledge from a shared constraint store. These features, and the elegant use of the constraint system to represent the abilities of attackers, make concurrent constraint programming and timed CCP (tcc) interesting candidates for modeling and reasoning about security pr...

متن کامل

Certificate Validation in Secure Computation and Its Use in Verifiable Linear Programming

For many applications of secure multiparty computation it is natural to demand that the output of the protocol is verifiable. Verifiability should ensure that incorrect outputs are always rejected, even if all parties executing the secure computation collude. Since the inputs to a secure computation are private, and potentially the outputs are private as well, adding verifiability is in general...

متن کامل

Secure Multi-party Computation Protocols from a High-Level Programming Language

Secure multi-party computation (SMC) enables privacy-preserving computations on data originating from a number of parties. In today’s digital world, data privacy is increasingly more difficult to provide. With SMC methods like secret sharing and Yao’s garbled circuits, it is possible to build privacypreserving computational protocols that do not leak confidential inputs to other parties. The ad...

متن کامل

Secure Routing Protocol: Affection on MANETs Performance

In mobile ad hoc networks, the absence ofinfrastructure and the consequent absence of authorizationfacilities impede the usual practice of establishing a practicalcriterion to distinguishing nodes as trusted and distrusted.Since all nodes in the MANETs would be used as router inmulti-hop applications, secure routing protocols have vital rulein the security of the network. So evaluating the perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017